Parallel Exact Inference

نویسندگان

  • Yinglong Xia
  • Viktor K. Prasanna
چکیده

In this paper, we present complete message-passing implementation that shows scalable performance while performing exact inference on arbitrary Bayesian networks. Our work is based on a parallel version of the classical technique of converting a Bayesian network to a junction tree before computing inference. We propose a parallel algorithm for constructing potential tables for a junction tree and explore the parallelism of rerooting technique for multiple evidence propagation. Our implementation also uses pointer jumping for parallel inference over the junction tree. For an arbitrary Bayesian network with n vertices using p processors, we show an execution time of O(nk m + nw + (nw + wN log n + rwwN + rwN log N)/p), where w is the clique width, r is the number of states of the random variables, k is the maximum node degree in the Bayesian network, km is the maximum node degree in the moralized graph and N is the number of cliques in the junction tree. Our implementation is shown to be scalable for 1 ≤ p ≤ n for moralization and clique identification, and 1 ≤ p ≤ N for junction tree construction, potential table construction, rerooting and evidence propagation. We have implemented the parallel algorithm using MPI on state-of-the-art clusters and our experiments show scalable performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact Inference on Manycore Processors Using Pointer Jumping

Exact inference is a key problem in exploring probabilistic graphical models. Most parallel algorithms for exact inference explore data and structural parallelism. These algorithms result in limited performance if the input model offers limited data and structural parallelism. In this paper, we study a pointer jumping based method on manycore systems for exact inference in junction trees. We ad...

متن کامل

Parallelizing Exact Inference in Bayesian Networks

Exact inference is an approach for computing probabilities in Bayesian networks. Recently, this has been studied by various teams in the DARPA ACIP program. The popular Lauritzen Speigelhalter algorithm [2] converts a given Bayesian Network to a Junction Tree representation and then computes the exact inference on the same. The reason for this intermediate tree representation is that the common...

متن کامل

Exact Statistical Inference for Some Parametric Nonhomogeneous Poisson Processes

Nonhomogeneous Poisson processes (NHPPs) are often used to model recurrent events, and there is thus a need to check model fit for such models. We study the problem of obtaining exact goodness-of-fit tests for certain parametric NHPPs, using a method based on Monte Carlo simulation conditional on sufficient statistics. A closely related way of obtaining exact confidence intervals in parametri...

متن کامل

Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models

The paper presents and evaluates the power of parallel search for exact MAP inference in graphical models. We introduce a new parallel shared-memory recursive best-first AND/OR search algorithm, called SPRBFAOO, that explores the search space in a best-first manner while operating with restricted memory. Our experiments show that SPRBFAOO is often superior to the current state-of-the-art sequen...

متن کامل

Logarithmic Time Parallel Bayesian Inference

I present a parallel algorithm for exact prob­ abilistic inference in Bayesian networks. For polytree networks with n variables, the worst­ case time complexity is O(log n) on a CREW PRAM (concurrent-read, exclusive-write paral­ lel random-access machine) with n processors, for any constant number of evidence variables. For arbitrary networks, the time complexity is O( r3w log n) for n processo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007